Flows, flow-pair covers and cycle double covers
نویسندگان
چکیده
منابع مشابه
Flows, flow-pair covers and cycle double covers
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, DiscreteMath. 244 (2002) 77–82] about edge-disjoint bipartizingmatchings of a cubic graphwith a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D, f1) and (D, f2)...
متن کاملInteger flows and cycle covers
Results related to integer flows and cycle covers are presented. A cycle cover of a graph G is a collection %Y of cycles of G which covers all edges of G; U is called a cycle m-cover of G if each edge of G is covered exactly m times by the members of V. By using Seymour’s nowhere-zero 6-flow theorem, we prove that every bridgeless graph has a cycle 6-cover associated to covering of the edges by...
متن کاملCycle double covers and spanning minors I
Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with even cycles has a cycle double cover, in fact a 6-CDC. We prove this for two other families of graphs similar to Kotzig graphs as well. In parti...
متن کاملCycle double covers and spanning minors II
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spanning subgraph isomorphic to a subdivision of a bridgeless cubic graph on at most 10 vertices then G has a CDC. A notable result is thus that a cubic graph with a spanning Petersen minor has a CDC, a result also obtaine...
متن کاملDirected cycle double covers and cut-obstacles
A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstructions to the existence of a directed cycle double cover in a graph are bridges. Jaeger [4] conjectured that bridges are actually the only obstructions. One of the difficulties in proving the Jaeg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.05.056